14b032c36f039ce4282e6d41772b9f3b89b8356f,enterprise/src/main/java/org/neo4j/graphalgo/impl/path/ShortestPath.java,ShortestPath,findSinglePath,#Node#Node#,57

Before Change


    
    public Path findSinglePath( Node start, Node end )
    {
        Collection<Path> paths = internalPaths( start, end, true );
        return paths.isEmpty() ? null : paths.iterator().next();
    }
    
    public Collection<Path> findPathsFromScetch( Node... someNodesAlongTheWay )

After Change


    
    public Path findSinglePath( Node start, Node end )
    {
        Iterator<Path> paths = internalPaths( start, end, true ).iterator();
        return paths.hasNext() ? paths.next() : null;
    }
    
    private Iterable<Path> internalPaths( Node start, Node end, boolean stopAsap )